Integral trees of arbitrarily large diameters
نویسندگان
چکیده
منابع مشابه
Integral Trees of Arbitrarily Large Diameters
In this paper we construct trees having only integer eigenvalues with arbitrarily large diameters. In fact, we prove that for every set S of positive integers there exists a tree whose positive eigenvalues are exactly the elements of S. If the set S is different from the set {1} then the constructed tree will have diameter 2|S|.
متن کاملIntegral trees of odd diameters
A graph is called integral if all eigenvalues of its adjacency matrix consist entirely of integers. Recently, Csikvári proved the existence of integral trees of any even diameter. In the odd case, integral trees have been constructed with diameter at most 7. In this paper, we show that for every odd integer n > 1, there are infinitely many integral trees of diameter n. AMS Mathematics Subject C...
متن کاملIntegral trees with diameters 5 and 6
In this paper, some new families of integral trees with diameters 5 and 6 are constructed. All these classes are infinite. They are different from those in the existing literature. We also prove that the problem of finding integral trees of diameters 5 and 6 is equivalent to the problem of solving some Diophantine equations. The discovery of these integral trees is a new contribution to the sea...
متن کاملIntegral trees with diameters 4, 6 and 8
In this paper, some new families of integral trees with diameters 4, 6 and 8 are given. All these classes are infinite. They are different from those in the existing literature. We also prove that the problem of finding integral trees of diameters 4, 6 and 8 is equivalent to the problem of solving Pell’s diophantine equations. The discovery of these integral trees is a new contribution to the s...
متن کاملMinimizing Diameters of Dynamic Trees
In this paper we consider an on{line problem related to minimizing the diameter of a dynamic tree T. A new edge f is added, and our task is to delete the edge e of the induced cycle so as to minimize the diameter of the resulting tree T ffgnfeg. Starting with a tree with n nodes, we show how each such best swap can be found in worst{case O(log 2 n) time. The problem was raised by Italiano and R...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algebraic Combinatorics
سال: 2010
ISSN: 0925-9899,1572-9192
DOI: 10.1007/s10801-010-0218-8